A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
نویسندگان
چکیده
منابع مشابه
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
Vertex deletion problems ask whether it is possible to delete at most k vertices from a graph so that the resulting graph belongs to a specified graph class. Over the past years, the parameterized complexity of vertex deletion to a plethora of graph classes has been systematically researched. Here we present the first single-exponential fixed-parameter algorithm for vertex deletion to distance-...
متن کاملA Polynomial Kernel for Distance-Hereditary Vertex Deletion
A graph is distance-hereditary if for any pair of vertices, their distance in every connected induced subgraph containing both vertices is the same as their distance in the original graph. Distance hereditary graphs are exactly the graphs with rank-width at most 1. The Distance-Hereditary Vertex Deletion problem asks, given a graph G on n vertices and an integer k, whether there is a set S of a...
متن کاملOn fixed-parameter algorithms for Split Vertex Deletion
In the SPLIT VERTEX DELETION problem, given a graph G and an integer k, we ask whether one can delete k vertices from the graph G to obtain a split graph (i.e., a graph, whose vertex set can be partitioned into two sets: one inducing a clique and the second one inducing an independent set). In this paper we study fixed-parameter algorithms for SPLIT VERTEX DELETION parameterized by k: we show t...
متن کاملSingle Exponential FPT Algorithm for Interval Vertex Deletion and Interval Completion Problem
Let G be an input graph with n vertices and m edges and let k be a fixed parameter. We provide a single exponential FPT algorithm with running time O(cn(n+m)), c = min{18, k} that turns graph G into an interval graph by deleting at most k vertices from G. This solves an open problem posed by Marx [19]. We also provide a single exponential FPT algorithm with running time O(cn(n + m)), c = min{17...
متن کاملAn Improved Fixed-Parameter Algorithm for Vertex Cover
The VERTEX COVER problem asks, for input consisting of a graph G on n vertices, and a positive integer k, whether there is a set of k vertices such that every edge of G is incident with at least one of these vertices. We give an algorithm for this problem that runs in time O(kn + (1.324718)'k'). In particular, this gives an 0((1.324718) " n2) algorithm to find the minimum vertex cover in the gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2018
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2018.05.005